A Direct-Sum Theorem for Read-Once Branching Programs
نویسندگان
چکیده
We study a direct-sum question for read-once branching programs. If M(f) denotes the minimum average memory required to compute a function f(x1, x2, . . . , xn) how much memory is required to compute f on k independent inputs that arrive in parallel? We show that when the inputs are sampled independently from some domain X and M(f) = Ω(n), then computing the value of f on k streams requires average memory at least Ω ( k · M(f) n ) . Our results are obtained by defining new ways to measure the information complexity of read-once branching programs. We define two such measures: the transitional and cumulative information content. We prove that any read-once branching program with transitional information content I can be simulated using average memory O(n(I + 1)). On the other hand, if every read-once branching program with cumulative information content I can be simulated with average memory O(I+ 1), then computing f on k inputs requires average memory at least Ω(k · (M(f)− 1)).
منابع مشابه
Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs
We prove the first lower bound for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is still a challenging open problem. The following variant of read–once parity branching programs is well–motivated. Le...
متن کاملRandomization and Nondeterminsm Are Incomparable for Ordered Read-once Branching Programs
In 3] we exhibited a simple boolean functions fn in n variables such that: 1) fn can be computed by polynomial size randomized ordered read-once branching program with one sided small error; 2) any nondeterministic ordered read-once branching program that computes fn has exponential size. In this paper we present a simple boolean function gn in n variables such that: 1) gn can be computed by po...
متن کاملThe optimal read-once branching program complexity for the direct storage access function
Branching programs are computation models measuring the space of (Turing machine) computations. Read-once branching programs (BP1s) are the most general model where each graph-theoretical path is the computation path for some input. Exponential lower bounds on the size of read-once branching programs are known since a long time. Nevertheless, there are only few functions where the BP1 size is a...
متن کاملRestricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, i.e., the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching ...
متن کاملParity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Branching programs are a well-established computation model for boolean functions, especially read-once branching programs have been studied intensively. Exponential lower bounds for deterministic and nondeterministic read-once branching programs are known for a long time. On the other hand, the problem of proving superpolynomial lower bounds for parity read-once branching programs is still ope...
متن کامل